Degree Graphs of Simple Linear and Unitary Groups
نویسنده
چکیده
Let G be a finite group and let cd(G) be the set of irreducible character degrees of G. The degree graph ∆(G) is the graph whose set of vertices is the set of primes that divide degrees in cd(G), with an edge between p and q if pq divides a for some degree a ∈ cd(G). We determine the graph ∆(G) for the finite simple groups of types A`(q) and A`(q ), that is, for the simple linear and unitary groups.
منابع مشابه
Computing Wiener and hyper–Wiener indices of unitary Cayley graphs
The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.
متن کاملOD-characterization of $U_3(9)$ and its group of automorphisms
Let $L = U_3(9)$ be the simple projective unitary group in dimension 3 over a field with 92 elements. In this article, we classify groups with the same order and degree pattern as an almost simple group related to $L$. Since $Aut(L)equiv Z_4$ hence almost simple groups related to $L$ are $L$, $L : 2$ or $L : 4$. In fact, we prove that $L$, $L : 2$ and $L : 4$ are OD-characterizable.
متن کاملA characterization of the symmetric group of prime degree
Let $G$ be a finite group and $Gamma(G)$ the prime graph of $G$. Recently people have been using prime graphs to study simple groups. Naturally we pose a question: can we use prime graphs to study almost simple groups or non-simple groups? In this paper some results in this respect are obtained and as follows: $Gcong S_p$ if and only if $|G|=|S_p|$ and $Gamma(G)=Gamma(S_p)$, whe...
متن کاملOD-characterization of almost simple groups related to U3(11)
Let $L := U_3(11)$. In this article, we classify groups with the same order and degree pattern as an almost simple group related to $L$. In fact, we prove that $L$, $L:2$ and $L:3$ are OD-characterizable, and $L:S_3$ is $5$-fold OD-characterizable.
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005